#include <iostream>

/**
 * 平衡序列
 * 测试链接：https://www.luogu.com.cn/problem/B4038
 * 
 * 考点：一维数组操作
 */

int arr[10010];
int main() {
    int t;
    std::cin >> t;
    while (t--) {
        int n;
        std::cin >> n;

        int sum = 0;
        for (int i = 0; i < n; i++) {
            std::cin >> arr[i];
            sum += arr[i];
        }

        // 若总和为奇数，直接返回 No
        if (sum % 2 != 0) {
            std::cout << "No\n";
            continue;
        }

        int half = sum / 2;
        int prefixSum = 0;
        bool isBalanced = false;
        for (int i = 0; i < n - 1; i++) {  // 只需检查前 n-1 个位置
            prefixSum += arr[i];
            if (prefixSum == half) {
                isBalanced = true;
            	break;
            }
        }

        if (isBalanced) {
            std::cout << "Yes\n";
        }else {
			std::cout << "No\n";
        }
    }

    return 0;
}